Let $S_n$ be the total gain in $n$ repeated St.\ Petersburg games. It isknown that $n^{-1}(S_n-n\log_2n)$ converges in distribution to a random element$Y(t)$ along subsequences of the form $k(n)=2^{p(n)}t(n)$ with$p(n)=\lceil\log_2k(n)\rceil\to\infty$ and $t(n)\to t\in[\frac12,1]$. Wedetermine the Hausdorff and box-counting dimension of the range and the graphfor almost all sample paths of the stochastic process $\{Y(t)\}_{t\in[1/2,1]}$.The results are compared to the fractal dimension of the corresponding limitingobjects when gains are given by a deterministic sequence initiated by HugoSteinhaus.
展开▼
机译:假设$ S_n $是重复的St. \ Petersburg游戏中的总收益。已知$ n ^ {-1}(S_n-n \ log_2n)$会沿着形式为$ k(n)= 2 ^ {p(n)}的子序列收敛到一个随机元素$ Y(t)$。 t(n)$和$ p(n)= \ lceil \ log_2k(n)\ rceil \ to \ infty $和$ t(n)\ to t \ in [\ frac12,1] $。对随机过程$ \ {Y(t)\} _ {t \ in [1 / 2,1]} $的几乎所有样本路径,确定范围和图形的Hausdorff和盒数维。比较结果当增益是由HugoSteinhaus启动的确定性序列给出时,则对应于相应限制对象的分形维数。
展开▼